منابع مشابه
Polynomial differential equations compute all real computable functions on computable compact intervals
In the last decade, the field of analog computation has experienced renewed interest. In particular, there have been several attempts to understand which relations exist between the many models of analog computation. Unfortunately, most models are not equivalent. It is known that Euler’s Gamma function is computable according to computable analysis, while it cannot be generated by Shannon’s Gen...
متن کاملComputable choice functions for computable linear orderings
One direction of research in computability theory is the study of the effective content of combinatorial theorems. The last chapter of Rosenstein’s book [2] reports on this type of investigation for linear orderings. Questions raised in that chapter have been the subject of a number of papers, and a summary of results in the area can be found in Downey [1]. In this paper, we consider the proble...
متن کاملQuantization causes waves: Smooth finitely computable functions are affine
Given an automaton (a letter-to-letter transducer) A whose input and output alphabets are Fp = {0, 1, . . . , p − 1}, one visualizes word transformations performed by A by a point set P(A) of real plane R2 as follows: To an m-letter non-empty word v = γm−1γm−2 . . . γ0 over the alphabet A put into the correspondence a rational number 0.v whose basep expansion is 0.γm−1γm−2 . . . γ0; then to eve...
متن کاملComputable functions of reals
We introduce a new notion of computable function on R and prove some basic properties. We give two applications, first a short proof of Yoshinaga’s theorem that periods are elementary (they are actually lower elementary). We also show that the lower elementary complex numbers form an algebraically closed field closed under exponentiation and some other special functions.
متن کاملMapcode Computable Functions
In this paper we discuss an alternative definition of a program. We name this formalization as a mapcode and attempt to explore the theoretical issues of computability by mapcodes. We show that mapcodes not only define programs as mathematical entities in a natural manner, but also they are equivalent to Turing machines. The equivalence is shown by proving that the class of mapcode computable f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ceylon Medical Journal
سال: 2014
ISSN: 2386-1274,0009-0875
DOI: 10.4038/cmj.v45i4.6574